Algorithmic Problems in Groups Semigroups and Inverse Semigroups
نویسندگان
چکیده
منابع مشابه
Brandt extensions and primitive topologically periodic inverse topological semigroups
In this paper we find sufficient conditions on primitive inverse topological semigroup S under which: the inversion inv : (H(S)) (H(S)) is continuous; we show that every topologically periodic countable compact primitive inverse topological semigroups with closed H-classes is topologically isomorphic to an orthogonal sum P i2= Bi (Gi) of topological Brandt extensions Bi (Gi) of countably compac...
متن کاملHnn - Extensions of F Inite I Nverse S Emigroups
THE concept of HNN-extensions of groups was introduced by Higman, Neumann and Neumann in 1949. HNN-extensions and amalgamated free products have played a crucial role in combinatorial group theory, especially for algorithmic problems. In inverse semigroup theory there are many ways of constructing HNNextension in order to ensure the embeddability of the original inverse semigroup in the new one...
متن کاملRestriction and Ehresmann Semigroups
Inverse semigroups form a variety of unary semigroups, that is, semigroups equipped with an additional unary operation, in this case a 7→ a−1. The theory of inverse semigroups is perhaps the best developed within semigroup theory, and relies on two factors: an inverse semigroup S is regular, and has semilattice of idempotents. Three major approaches to the structure of inverse semigroups have e...
متن کاملA graphical difference between the inverse and regular semigroups
In this paper we investigate the Green graphs for the regular and inverse semigroups by considering the Green classes of them. And by using the properties of these semigroups, we prove that all of the five Green graphs for the inverse semigroups are isomorphic complete graphs, while this doesn't hold for the regular semigroups. In other words, we prove that in a regular se...
متن کاملFast Fourier Transforms for Finite Inverse Semigroups
We extend the theory of fast Fourier transforms on finite groups to finite inverse semigroups. We use a general method for constructing the irreducible representations of a finite inverse semigroup to reduce the problem of computing its Fourier transform to the problems of computing Fourier transforms on its maximal subgroups and a fast zeta transform on its poset structure. We then exhibit exp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995